Relational mining for discovering changes in evolving networks
نویسندگان
چکیده
Networks are data structures more and more frequently used for modeling interactions in social and biological phenomena, as well as between various types of devices, tools and machines. They can be either static or dynamic, dependently on whether the modeled interactions are fixed or changeable over time. Static networks have been extensively investigated in data mining, while fewer studies have focused on dynamic networks and how to discover complex patterns in large, evolving networks. In this paper we focus on the task of discovering changes in evolving networks and we overcome some limits of existing methods (i) by resorting to a relational approach for representing networks characterized by heterogeneous nodes and/or heterogeneous relationships, and (ii) by proposing a novel algorithm for discovering changes in the structure of a dynamic network over time. Experimental results and comparisons with existing approaches on real-world datasets prove the effectiveness and efficiency of the proposed solution and provide some insights on the effect of some parameters in discovering and modeling the evolution of the whole network, or a subpart of it. & 2014 Elsevier B.V. All rights reserved.
منابع مشابه
Representations and Ensemble Methods for Dynamic Relational Classification
Temporal networks are ubiquitous and evolve over time by the addition, deletion, and changing of links, nodes, and attributes. Although many relational datasets contain temporal information, the majority of existing techniques in relational learning focus on static snapshots and ignore the temporal dynamics. We propose a framework for discovering temporal representations of relational data to i...
متن کاملDiscovering descriptive rules in relational dynamic graphs
Graph mining methods have become quite popular and a timely challenge is to discover dynamic properties in evolving graphs or networks. We consider the so-called relational dynamic oriented graphs that can be encoded as n-ary relations with n 3 and thus represented by Boolean tensors. Two dimensions are used to encode the graph adjacency matrices and at least one other denotes time. We design t...
متن کاملTemporal Pattern Mining from Evolving Networks
Recently, evolving networks are becoming a suitable form to model many realworld complex systems, due to their peculiarities to represent the systems and their constituting entities, the interactions between the entities and the timevariability of their structure and properties. Designing computational models able to analyze evolving networks becomes relevant in many applications [1]. The evolu...
متن کاملData Mining for Community Dynamics
Online platforms are virtual places where people interact for different purposes, thus forming online communities. So far several mining methods have been developed to detect these community structures as densely connected subgraphs in networks. The evolution of these networks is typically analyzed by observing changes in the interaction behavior of single members only. However, we observe that...
متن کاملDiscovering and Exploiting Statistical Properties for Query Optimization in Relational Databases: A Survey
Discovering and exploiting statistical features in relational datasets is key to query optimization in a relational database management system (rdbms), and is also needed for database design, cleaning, and integration. This paper surveys a variety of methods for automatically discovering important statistical features such as correlations, functional dependencies, keys, and algebraic constraint...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Neurocomputing
دوره 150 شماره
صفحات -
تاریخ انتشار 2015